The Second Calculus of Binary Relations

نویسنده

  • Vaughan R. Pratt
چکیده

We view the Chu space interpretation of linear logic as an alternative interpretation of the language of the Peirce calculus of binary relations. Chu spaces amount to K-valued binary relations, which for K = 2 we show generalize n-ary relational structures. We also exhibit a four-stage unique factorization system for Chu transforms that illuminates their op-

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Origins of the Calculus of Binary Relations

The calculus of binary relations was introduced by De Morgan in 1860, and was subsequently greatly developed by Peirce and Schröder. Half a century later Tarski, Jónsson, Lyndon, and Monk further developed the calculus from the perspective of modern model theory.

متن کامل

Safety for bisimulation in monadic second-order logic

We characterize those formulas of MSO monadic second order logic that are safe for bisim ulation formulas de ning binary relations such that any bisimulation is also a bisimulation with respect to these de ned relations Every such formula is equivalent to one constructed from calculus tests atomic actions and the regular operations The proof uses a characterization of completely additive calcul...

متن کامل

A Complete Natural Deduction System for the Relational Calculus

A relational calculus is a formal system in which relation is the fundamental concept. The simplest relational calculus, that of ordinary binary relations, was introduced by Tarski in [4]. Tarski’s system is essentially an algebra in which the operations are the usual Boolean operations (on sets of ordered pairs) together with the two special operations converse (denoted byq) and composition (d...

متن کامل

Relating Paths in Transition Systems: the Fall of the Modal mu-Calculus

This is an extended abstract of a paper presented at MFCS 2015 [11]. Monadic second-order logic (MSO) is considered as a standard for comparing expressiveness of logics of programs. Ground-breaking results concerning expressiveness and decidability of MSO on infinite graphs were obtained first on “freely-generated” structures (words, trees, tree-like structures, etc.) [28,30], then on “non-free...

متن کامل

Bisimulation Safe Fixed Point Logic

We define and investigate a new modal fixed-point logic, called bisimulation safe fixed-point logic BSFP, which is a calculus of binary relations that extends both PDL and the modal μ-calculus. The logic is motivated by concepts and results due to van Benthem and Hollenberg on bisimulation safety which plays a similar role for binary relations as the more familiar notion of bisimulation invaria...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993